LEARNING TO SUPPORT CONSTRAINT PROGRAMMERS
نویسندگان
چکیده
منابع مشابه
Learning to Support Constraint Programmers
This paper describes the Adaptive Constraint Engine (ACE), an ambitious ongoing research project to support constraint programmers, both human and machine. The program begins with substantial knowledge about constraint satisfaction. The program harnesses a cognitively oriented architecture—FOr the Right Reasons (FORR) to manage search heuristics and to learn new ones. ACE can transfer what it l...
متن کاملLearning from Project History to Support Programmers
Nowadays, any larger software project collects lots of data. Changes to source code are stored in version control archives, and problems in bug databases. In this paper we present two tools that mine both sources to help developers writing better programs. The eROSE tool guides programmers along related changes in a similar way Amazon.com supports its customers: You changed fKeys[] and eROSE su...
متن کاملwillingness to communicate in the iranian context: language learning orientation and social support
why some learners are willing to communicate in english, concurrently others are not, has been an intensive investigation in l2 education. willingness to communicate (wtc) proposed as initiating to communicate while given a choice has recently played a crucial role in l2 learning. it was hypothesized that wtc would be associated with language learning orientations (llos) as well as social suppo...
Metacognitive Support Accelerates Computer Assisted Learning for Novice Programmers
Computer programming is a part of the curriculum in computer science education, and high drop rates for this subject are a universal problem. Development of metacognitive skills, including the conceptual framework provided by socio-cognitive theories that afford reflective thinking, such as actively monitoring, evaluating, and modifying one’s thinking, has been identified as important for novic...
متن کاملRelative Support Weight Learning for Constraint Solving
Many real-world problems can be represented and solved as constraint satisfaction problems, but their solution requires the development of effective, efficient constraint solvers. A constraint solver’s success depends greatly upon the heuristics chosen to guide search. Some heuristics perform well on one class of problems, but are less successful on others. The solver described here learns a we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Intelligence
سال: 2005
ISSN: 0824-7935,1467-8640
DOI: 10.1111/j.1467-8640.2005.00277.x